Survey topic: Parallel Clustering Algorithms Annotated Bibliography of the literature found
نویسندگان
چکیده
** This thesis studies graph clustering on bipartite and chordal graphs. It describes two types of clustering problems: a partition of the vertex of a graph with minimum diameters of subgraphs; maximizing possible number of edges given fixed number of vertices.
منابع مشابه
Survey topic: Parallel Clustering Algorithms Detailed Annotated Bibliography and Classification of the Results
The major challenges of sequential clustering algorithms are scaling up to very large database sizes, which leads to high computational and spatial costs. Therefore, development of parallel clustering algorithms are natural process. But, we also notice that clustering task itself is used for parallelization of other algorithms as it groups the data set into smaller subsets. In other words, clus...
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملCS 279 Annotated Course Bibliography
This annotated bibliography is a complement to a set of course notes for CS 279, System Support for Scientific Computation, taught in Spring 2001 by W. Kahan at UC Berkeley. It is meant to be representative, not comprehensive, and includes pointers to survey works and online bibliographies which cover the literature in various areas in more depth. In the hope of making the bilbiography simpler ...
متن کاملPlanarizing Graphs - A Survey and Annotated Bibliography
Given a finite, undirected, simple graph G, we are concerned with operations on G that transform it into a planar graph. We give a survey of results about such operations and related graph parameters. While there are many algorithmic results about planarization through edge deletion, the results about vertex splitting, thickness, and crossing number are mostly of a structural nature. We also in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009